Physical Zero-Knowledge Proof for Ripple Effect

نویسندگان

چکیده

Ripple Effect is a logic puzzle with an objective to fill numbers into rectangular grid divided rooms. Each room must contain consecutive integers starting from 1 its size. Also, if two cells in the same row or column have number x, space separating be at least x cells. In this paper, we propose physical protocol of zero-knowledge proof for using deck cards, which allows prover physically show that he/she knows solution without revealing it. particular, develop that, given secret and list numbers, verifies does not appear among first any list.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Problem 1 : Zero Knowledge Proof

a. To check that the graph is represented correctly, Bob asks Alice to remove all the paper cups covering the endpoints of every edge. This reveals an isomorphism to the original graph, which Bob cannot check efficiently; thus, Bob also removes the paper cups corresponding to the green numbers, revealing the original labelling of the vertices. This reveals nothing about the vertex cover, but al...

متن کامل

Efficient Zero-Knowledge Proof Systems

A proof system can be used by a prover to demonstrate to one or more verifiers that a statement is true. Proof systems can be interactive where the prover and verifier exchange many messages, or non-interactive where the prover sends a single convincing proof to the verifier. Proof systems are widely used in cryptographic protocols to verify that a party is following a protocol correctly and is...

متن کامل

Two Factor Zero Knowledge Proof Authentication System

It is often necessary to log onto a website or other system from an untrusted device using an untrusted connection. In this paper, we propose a login protocol that can be implemented to allow security in this situation. The protocol is a two factor authentication scheme which utilizes zero knowledge proofs to convince a server, over an unsecure connection, that the user knows his password witho...

متن کامل

Universally Composable Zero-Knowledge Proof of Membership

Since its introduction the UC framework by Canetti has received a lot of attention. A contributing factor to its popularity is that it allows to capture a large number of common cryptographic primitives using ideal functionalities and thus can be used to give modular proofs for many cryptographic protocols. However, an important member of the cryptographic family has not yet been captured by an...

متن کامل

Non-Interactive Zero-Knowledge Proof Systems

The intriguing notion of a Zerc-Knowledge Proof System has been introduced by Goldwasser, Micali and Rackoff [GMR] and its wide applicability has been demonstrated by Goldreich, Micali and Wigderson (GMWl]-[GMWZ]. Based on complexity theoretic assumptions, Zero-Knowledge Proof Systems exist, provided that (i) The prover and the verifier are allowed to talk back and forth. (ii) The verifier is a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2021

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-68211-8_24